Quartets and Parameter Recovery for the General Markov Model of Sequence Mutation
نویسندگان
چکیده
Methods of inference of the evolutionary history leading to currently extant species, or taxa, have been transformed in recent years by the ready availability of biological sequence data such as that from DNA. While many approaches to this inference problem have been developed, some of the methods most appealing theoretically are so computationally intensive that they cannot be carried out exactly when studying a large number of taxa. One approach to this issue is to first infer phylogenetic trees for smaller subsets of the taxa, and then attempt to combine these smaller trees into a single larger one. In particular, quartet methods of phylogenetic inference from biological sequence data for n taxa entail first inferring the topology, perhaps with a measure of confidence, of some or all of the trees relating subsets of four taxa, using information on those four taxa alone. These quartet trees are then pieced together to form a larger tree, by any one of a number of methods that have been proposed, such as those in [3, 4, 8, 17] to name only a few. If the inference problem begins with a collection of aligned sequences, of DNA for instance, from the n taxa, then use of a quartet method would mean using these aligned sequences only in subcollections of 4 at a time. Thus some information is potentially being ignored. Understanding what information may be lost is therefore of interest.
منابع مشابه
Low-parameter phylogenetic estimation under the general Markov model
In their 2008 and 2009 papers, Sumner and colleagues introduced the “squangles” – a small set of Markov invariants for phylogenetic quartets. The squangles are consistent with the general Markov model (GM) and can be used to infer quartets without the need to explicitly estimate all parameters. As GM is inhomogeneous and hence non-stationary, the squangles are expected to perform well compared ...
متن کاملVacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery
Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (seco...
متن کاملLow-parameter phylogenetic inference under the general markov model.
In their 2008 and 2009 articles, Sumner and colleagues introduced the "squangles"-a small set of Markov invariants for phylogenetic quartets. The squangles are consistent with the general Markov (GM) model and can be used to infer quartets without the need to explicitly estimate all parameters. As the GM model is inhomogeneous and hence nonstationary, the squangles are expected to perform well ...
متن کاملImproving Phoneme Sequence Recognition using Phoneme Duration Information in DNN-HSMM
Improving phoneme recognition has attracted the attention of many researchers due to its applications in various fields of speech processing. Recent research achievements show that using deep neural network (DNN) in speech recognition systems significantly improves the performance of these systems. There are two phases in DNN-based phoneme recognition systems including training and testing. Mos...
متن کاملA generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences
The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...
متن کامل